A Motzkin filter in the Tamari lattice

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Motzkin filter in the Tamari lattice

The Tamari lattice of order n can be defined on the set Tn of binary trees endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we restrict our attention to the subset Mn of Motzkin trees. This set appears as a filter of the Tamari lattice. We prove that its diameter is 2n − 5 and that its radius is n − 2. Enumeration results are given for jo...

متن کامل

Motzkin subposets and Motzkin geodesics in Tamari lattices

The Tamari lattice of order n can be defined by the set Dn of Dyck words endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we study this rotation on the restricted set of Motzkin words. An upper semimodular join semilattice is obtained and a shortest path metric can be defined. We compute the corresponding distance between two Motzkin word...

متن کامل

On a Subposet of the Tamari Lattice

We discuss some properties of a subposet of the Tamari lattice introduced by Pallo (1986), which we call the comb poset. We show that three binary functions that are not well-behaved in the Tamari lattice are remarkably well-behaved within an interval of the comb poset: rotation distance, meets and joins, and the common parse words function for a pair of trees. We relate this poset to a partial...

متن کامل

Balanced binary trees in the Tamari lattice

We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T0, T1] where T0 and T1 are balanced trees are isomorphic as posets to a hypercube. We introduce tree patterns and synchronous grammars to get a functional equation of the generating series enumerating balanced tree intervals. Résumé. Nous montrons que l’ensemble des arbre...

متن کامل

Chains of Maximum Length in the Tamari Lattice

The Tamari lattice Tn was originally defined on bracketings of a set of n+1 objects, with a cover relation based on the associativity rule in one direction. Although in several related lattices, the number of maximal chains is known, quoting Knuth, “The enumeration of such paths in Tamari lattices remains mysterious.” The lengths of maximal chains vary over a great range. In this paper, we focu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2015

ISSN: 0012-365X

DOI: 10.1016/j.disc.2015.02.024